<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>QuantumLibrary: /bb/mbigc/mbig5696/git/quantum_external/src/impl/quantum_coroutine_pool_allocator_impl.h Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
  $(document).ready(initResizable);
/* @license-end */</script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">QuantumLibrary
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('../../',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d3/d85/quantum__coroutine__pool__allocator__impl_8h_source.html','../../');});
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">quantum_coroutine_pool_allocator_impl.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">** Copyright 2018 Bloomberg Finance L.P.</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">**</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">** Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">** you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">** You may obtain a copy of the License at</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">**</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">**     http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">**</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">** Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">** distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">** See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">** limitations under the License.</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">*/</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">//NOTE: DO NOT INCLUDE DIRECTLY</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#include &lt;type_traits&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#include &lt;assert.h&gt;</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#if defined(BOOST_USE_VALGRIND)</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">    #include &lt;valgrind/valgrind.h&gt;</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">//##############################################################################################</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">//#################################### IMPLEMENTATIONS #########################################</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">//##############################################################################################</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">namespace </span><a class="code" href="../../d6/db9/namespaceBloomberg.html">Bloomberg</a> {</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="keyword">namespace </span>quantum {</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a777ecf7eca1488dd021d6945279e57fb">   32</a></span>&#160;<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a777ecf7eca1488dd021d6945279e57fb">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::CoroutinePoolAllocator</a>(<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a4d0537afc0879d9fcb02160f1911e3da">index_type</a> size) :</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    _size(size),</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    _blocks(new Header*[size]),</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    _freeBlocks(new <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a4d0537afc0879d9fcb02160f1911e3da">index_type</a>[size]),</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    _freeBlockIndex(size-1),</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    _numHeapAllocatedBlocks(0),</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    _stackSize(<a class="code" href="../../d8/dcc/namespacestd.html">std</a>::min(<a class="code" href="../../d8/dcc/namespacestd.html">std</a>::max(<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#aa7c417f09663e08f77cfff8fde215e4e">traits</a>::default_size(), <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#aa7c417f09663e08f77cfff8fde215e4e">traits</a>::minimum_size()), <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#aa7c417f09663e08f77cfff8fde215e4e">traits</a>::maximum_size()))</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;{</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keywordflow">if</span> (!_blocks || !_freeBlocks) {</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordflow">throw</span> std::bad_alloc();</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    }</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keywordflow">if</span> (_size == 0) {</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;Invalid coroutine allocator pool size&quot;</span>);</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    }</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="comment">//pre-allocate all the coroutine stack blocks</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    <span class="keywordflow">for</span> (<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a4d0537afc0879d9fcb02160f1911e3da">index_type</a> i = 0; i &lt; size; ++i) {</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        _blocks[i] = reinterpret_cast&lt;Header*&gt;(<span class="keyword">new</span> <span class="keywordtype">char</span>[_stackSize]);</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordflow">if</span> (!_blocks[i]) {</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            <span class="keywordflow">throw</span> std::bad_alloc();</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        }</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        _blocks[i]-&gt;_pos = i; <span class="comment">//mark position</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    }</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    <span class="comment">//initialize the free block list</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keywordflow">for</span> (<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a4d0537afc0879d9fcb02160f1911e3da">index_type</a> i = 0; i &lt; size; ++i) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        _freeBlocks[i] = i;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    }</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;}</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#ad3e0c8e3233615712b18ab02de62e20f">   61</a></span>&#160;<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a777ecf7eca1488dd021d6945279e57fb">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::CoroutinePoolAllocator</a>(<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;</a>&amp;&amp; other)</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;{</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    *<span class="keyword">this</span> = other;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;}</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#ad19e0fbc391d835c7835d2c5f5372646">   67</a></span>&#160;<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;</a>&amp; <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a1d0c57b06838120b374238f93b0efb20">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::operator=</a>(<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;</a>&amp;&amp; other)</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;{</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    _size = other._size;</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    _blocks = other._blocks;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    _freeBlocks = other._freeBlocks;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    _freeBlockIndex = other._freeBlockIndex;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;    _numHeapAllocatedBlocks = other._numHeapAllocatedBlocks;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    </div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    <span class="comment">// Reset other</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    other._blocks = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    other._freeBlocks = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    other._freeBlockIndex = -1;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    other._numHeapAllocatedBlocks = 0;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;}</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a9da759340b01b6f4979c201b7594020b">   83</a></span>&#160;<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a9da759340b01b6f4979c201b7594020b">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::~CoroutinePoolAllocator</a>()</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;{</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _size; ++i) {</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keyword">delete</span>[] (<span class="keywordtype">char</span>*)_blocks[i];</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    }</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;    <span class="keyword">delete</span>[] _blocks;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    <span class="keyword">delete</span>[] _freeBlocks;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;}</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a468a9ce4e5bc85bc33629f07dec92b4b">   93</a></span>&#160;boost::context::stack_context <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a468a9ce4e5bc85bc33629f07dec92b4b">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::allocate</a>() {</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    boost::context::stack_context ctx;</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    Header* block = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    {</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <a class="code" href="../../db/de4/classBloomberg_1_1quantum_1_1SpinLock_1_1Guard.html">SpinLock::Guard</a> lock(_spinlock);</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="keywordflow">if</span> (!isEmpty())</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        {</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            block = _blocks[_freeBlocks[_freeBlockIndex--]];</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        }</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    }</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    <span class="keywordflow">if</span> (!block) {</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="comment">// Use heap allocation</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        block = (Header*)<span class="keyword">new</span> <span class="keywordtype">char</span>[_stackSize];</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">if</span> (!block) {</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            <span class="keywordflow">throw</span> std::bad_alloc();</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        }</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        block-&gt;_pos = -1; <span class="comment">//mark position as non-managed</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <a class="code" href="../../db/de4/classBloomberg_1_1quantum_1_1SpinLock_1_1Guard.html">SpinLock::Guard</a> lock(_spinlock);</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        ++_numHeapAllocatedBlocks;</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    }</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    <span class="keywordtype">char</span>* block_start = reinterpret_cast&lt;char*&gt;(block) + <span class="keyword">sizeof</span>(Header);</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    ctx.size = _stackSize - <span class="keyword">sizeof</span>(Header);</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    ctx.sp = block_start + ctx.size;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="preprocessor">    #if defined(BOOST_USE_VALGRIND)</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        ctx.valgrind_stack_id = VALGRIND_STACK_REGISTER(ctx.sp, block_start);</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="preprocessor">    #endif</span></div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    <span class="keywordflow">return</span> ctx;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;}</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a45167e2ddf384fefbe0bb4c9103712be">  123</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a45167e2ddf384fefbe0bb4c9103712be">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::deallocate</a>(<span class="keyword">const</span> boost::context::stack_context&amp; ctx) {</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    <span class="keywordflow">if</span> (!ctx.sp) {</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;        <span class="keywordflow">return</span>;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    }</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;<span class="preprocessor">#if defined(BOOST_USE_VALGRIND)</span></div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    VALGRIND_STACK_DEREGISTER(ctx.valgrind_stack_id);</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    <span class="keywordflow">if</span> (isManaged(ctx)) {</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        <span class="comment">//find index of the block</span></div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        <a class="code" href="../../db/de4/classBloomberg_1_1quantum_1_1SpinLock_1_1Guard.html">SpinLock::Guard</a> lock(_spinlock);</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        _freeBlocks[++_freeBlockIndex] = blockIndex(ctx);</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    }</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        <span class="keyword">delete</span>[] (<span class="keywordtype">char</span>*)getHeader(ctx);</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;        <a class="code" href="../../db/de4/classBloomberg_1_1quantum_1_1SpinLock_1_1Guard.html">SpinLock::Guard</a> lock(_spinlock);</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;        --_numHeapAllocatedBlocks;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;        assert(_numHeapAllocatedBlocks &gt;= 0);</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    }</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;}</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a3fe7e965420b603f3bc19e6caf168207">  144</a></span>&#160;<span class="keywordtype">size_t</span> <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a3fe7e965420b603f3bc19e6caf168207">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::allocatedBlocks</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;    <span class="keywordflow">return</span> _size - _freeBlockIndex - 1;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;}</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#adaa7c84b5b8ee2fa9f838608f534b405">  150</a></span>&#160;<span class="keywordtype">size_t</span> <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#adaa7c84b5b8ee2fa9f838608f534b405">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::allocatedHeapBlocks</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    <span class="keywordflow">return</span> _numHeapAllocatedBlocks;</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;}</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a0e249a30241d229c404eb4a4c47c44cb">  156</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a0e249a30241d229c404eb4a4c47c44cb">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::isFull</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;    <span class="keywordflow">return</span> _freeBlockIndex == _size-1;</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;}</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#af17756f32beff0784891da52f92b5812">  162</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#af17756f32beff0784891da52f92b5812">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::isEmpty</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;    <span class="keywordflow">return</span> _freeBlockIndex == -1;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;}</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;<span class="keyword">typename</span> <a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::Header</a>*</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;<a class="code" href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html">CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::getHeader</a>(<span class="keyword">const</span> boost::context::stack_context&amp; ctx)<span class="keyword"> const</span></div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    <span class="keywordflow">return</span> reinterpret_cast&lt;Header*&gt;(reinterpret_cast&lt;char*&gt;(ctx.sp) - ctx.size - <span class="keyword">sizeof</span>(Header));</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;}</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="keywordtype">bool</span> CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::isManaged(<span class="keyword">const</span> boost::context::stack_context&amp; ctx)<span class="keyword"> const</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;    <span class="keywordflow">return</span> blockIndex(ctx) != -1;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;}</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> STACK_TRAITS&gt;</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;<span class="keywordtype">int</span> CoroutinePoolAllocator&lt;STACK_TRAITS&gt;::blockIndex(<span class="keyword">const</span> boost::context::stack_context&amp; ctx)<span class="keyword"> const</span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;<span class="keyword"></span>{</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    <span class="keywordflow">return</span> getHeader(ctx)-&gt;_pos;</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;}</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;}}</div><div class="ttc" id="classBloomberg_1_1quantum_1_1SpinLock_1_1Guard_html"><div class="ttname"><a href="../../db/de4/classBloomberg_1_1quantum_1_1SpinLock_1_1Guard.html">Bloomberg::quantum::SpinLock::Guard</a></div><div class="ttdef"><b>Definition:</b> quantum_spinlock.h:71</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_aa7c417f09663e08f77cfff8fde215e4e"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#aa7c417f09663e08f77cfff8fde215e4e">Bloomberg::quantum::CoroutinePoolAllocator::traits</a></div><div class="ttdeci">STACK_TRAITS traits</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator.h:46</div></div>
<div class="ttc" id="namespaceBloomberg_html"><div class="ttname"><a href="../../d6/db9/namespaceBloomberg.html">Bloomberg</a></div><div class="ttdef"><b>Definition:</b> quantum_buffer_impl.h:22</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a9da759340b01b6f4979c201b7594020b"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a9da759340b01b6f4979c201b7594020b">Bloomberg::quantum::CoroutinePoolAllocator::~CoroutinePoolAllocator</a></div><div class="ttdeci">virtual ~CoroutinePoolAllocator()</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:83</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a45167e2ddf384fefbe0bb4c9103712be"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a45167e2ddf384fefbe0bb4c9103712be">Bloomberg::quantum::CoroutinePoolAllocator::deallocate</a></div><div class="ttdeci">void deallocate(const boost::context::stack_context &amp;ctx)</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:123</div></div>
<div class="ttc" id="namespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdef"><b>Definition:</b> quantum_stl_impl.h:23</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html">Bloomberg::quantum::CoroutinePoolAllocator</a></div><div class="ttdoc">Provides fast (quasi zero-time) in-place allocation for coroutines. Coroutine stacks are pre-allocate...</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator.h:40</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_af17756f32beff0784891da52f92b5812"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#af17756f32beff0784891da52f92b5812">Bloomberg::quantum::CoroutinePoolAllocator::isEmpty</a></div><div class="ttdeci">bool isEmpty() const</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:162</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a777ecf7eca1488dd021d6945279e57fb"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a777ecf7eca1488dd021d6945279e57fb">Bloomberg::quantum::CoroutinePoolAllocator::CoroutinePoolAllocator</a></div><div class="ttdeci">CoroutinePoolAllocator(index_type size)</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:32</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a0e249a30241d229c404eb4a4c47c44cb"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a0e249a30241d229c404eb4a4c47c44cb">Bloomberg::quantum::CoroutinePoolAllocator::isFull</a></div><div class="ttdeci">bool isFull() const</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:156</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a3fe7e965420b603f3bc19e6caf168207"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a3fe7e965420b603f3bc19e6caf168207">Bloomberg::quantum::CoroutinePoolAllocator::allocatedBlocks</a></div><div class="ttdeci">size_t allocatedBlocks() const</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:144</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_adaa7c84b5b8ee2fa9f838608f534b405"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#adaa7c84b5b8ee2fa9f838608f534b405">Bloomberg::quantum::CoroutinePoolAllocator::allocatedHeapBlocks</a></div><div class="ttdeci">size_t allocatedHeapBlocks() const</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:150</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a1d0c57b06838120b374238f93b0efb20"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a1d0c57b06838120b374238f93b0efb20">Bloomberg::quantum::CoroutinePoolAllocator::operator=</a></div><div class="ttdeci">CoroutinePoolAllocator &amp; operator=(const this_type &amp;)=delete</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a4d0537afc0879d9fcb02160f1911e3da"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a4d0537afc0879d9fcb02160f1911e3da">Bloomberg::quantum::CoroutinePoolAllocator::index_type</a></div><div class="ttdeci">uint16_t index_type</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator.h:45</div></div>
<div class="ttc" id="structBloomberg_1_1quantum_1_1CoroutinePoolAllocator_html_a468a9ce4e5bc85bc33629f07dec92b4b"><div class="ttname"><a href="../../db/d67/structBloomberg_1_1quantum_1_1CoroutinePoolAllocator.html#a468a9ce4e5bc85bc33629f07dec92b4b">Bloomberg::quantum::CoroutinePoolAllocator::allocate</a></div><div class="ttdeci">boost::context::stack_context allocate()</div><div class="ttdef"><b>Definition:</b> quantum_coroutine_pool_allocator_impl.h:93</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="../../dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="../../dir_3808e3f8fe545b07b1d2715928fb0eea.html">impl</a></li><li class="navelem"><b>quantum_coroutine_pool_allocator_impl.h</b></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
  </ul>
</div>
</body>
</html>
